A Geometric Approach to Graph Isomorphism
نویسندگان
چکیده
We present an integer linear program (IP), for the Graph Isomorphism (GI) problem, which has non-empty feasible solution if and only if the input pair of graphs are isomorphic. We study the polytope of the convex hull of the solution points of IP, denoted by B. Exponentially many facets of this polytope are known. We show that in case of non-isomorphic pairs of graphs if a feasible solution exists for the linear program relaxation (LP) of the IP, then it violates a unique facet of B. We present an algorithm for GI based on the solution of LP and prove that it detects non-isomorphism in polynomial time if the solution of the LP violates any of the known facets.
منابع مشابه
Including Geometry in Graph Representations: A Quadratic-Time Graph Isomorphism Algorithm and Its Application
Abs t rac t . In graph representations of objects, geometric information is typically lost. This has forced researchers to use graph matching techniques that are intended to handle general graphs. By encoding the lost geometric information into graph representations, however, we can apply more efficient algorithms for constrained graphs. In this paper we introduce an edge ordering property that...
متن کاملGraph Isomorphism for Unit Square Graphs
In the past decades for more and more graph classes the Graph Isomorphism Problem was shown to be solvable in polynomial time. An interesting family of graph classes arises from intersection graphs of geometric objects. In this work we show that the Graph Isomorphism Problem for unit square graphs, intersection graphs of axis-parallel unit squares in the plane, can be solved in polynomial time....
متن کاملGenerating an Indoor space routing graph using semantic-geometric method
The development of indoor Location-Based Services faces various challenges that one of which is the method of generating indoor routing graph. Due to the weaknesses of purely geometric methods for generating indoor routing graphs, a semantic-geometric method is proposed to cover the existing gaps in combining the semantic and geometric methods in this study. The proposed method uses the CityGML...
متن کاملThe Complexity of Geometric Graph Isomorphism
We study the complexity of Geometric Graph Isomorphism, in l2 and other lp metrics: given two sets of n points A,B ⊂ Q in k-dimensional euclidean space the problem is to decide if there is a bijection π : A→ B such that for all x, y ∈ A, d(x, y) = d(π(x), π(y)), where d is the distance given by the metric. Our results are the following: • We describe algorithms for isomorphism and canonization ...
متن کاملInfinite Random Geometric Graphs
We introduce a new class of countably infinite random geometric graphs, whose vertices V are points in a metric space, and vertices are adjacent independently with probability p ∈ (0, 1) if the metric distance between the vertices is below a given threshold. If V is a countable dense set in R equipped with the metric derived from the L∞-norm, then it is shown that with probability 1 such infini...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014